منابع مشابه
N ov 2 00 4 Dynamics and Universality of Unimodal Mappings with Infinite Criticality
We consider infinitely renormalizable unimodal mappings with topological type which is periodic under renormalization. We study the limiting behavior of fixed points of the renormalization operator as the order of the critical point increases to infinity. It is shown that a limiting dynamics exists, with a critical point that is flat, but still having a well-behaved analytic continuation to a n...
متن کاملun 2 00 3 Dynamics and Universality of Unimodal Mappings with Infinite Criticality
We consider infinitely renormalizable unimodal mappings with topological type which is periodic under renormalization. We study the limiting behavior of fixed points of the renormalization operator as the order of the critical point increases to infinity. It is shown that a limiting dynamics exists, with a critical point that is flat, but still having a well-behaved analytic continuation to a n...
متن کاملVisibly pushdown automata on trees: universality and u-universality
An automaton is universal if it accepts every possible input. We study the notion of u-universality, which asserts that the automaton accepts every input starting with u. Universality and u-universality are both EXPTIME-hard for non-deterministic tree automata. We propose efficient antichain-based techniques to address these problems for visibly pushdown automata operating on trees. One of our ...
متن کاملTotally Real Mappings and Independent Mappings
The optimal dimensions N are determined so that each smooth manifold of dimension n admits a totally real immersion or an independent map to C . Detailed results comparing these two optimal dimensions, as well as some related results, are presented for four-manifolds.
متن کاملUniversality and Tolerance
For any positive integers and , let denote the family of graphs on vertices with maximum degree , and let denote the family of bipartite graphs on vertices with vertices in each vertex class, and with maximum degree . On one hand, we note that any -universal graph must have edges. On the other hand, for any , we explicitly construct -universal graphs and on and vertices, and with ! "$# % & ' ( ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2004
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(03)00207-4